Optimal On-line Selection of an Alternating Subsequence: a Central Limit Theorem
نویسندگان
چکیده
We analyze the optimal policy for the sequential selection of an alternating subsequence from a sequence of n independent observations from a continuous distribution F , and we prove a central limit theorem for the number of selections made by that policy. The proof exploits the backward recursion of dynamic programming and assembles a detailed understanding of the associated value functions and selection rules.
منابع مشابه
Central Limit Theorem in Multitype Branching Random Walk
A discrete time multitype (p-type) branching random walk on the real line R is considered. The positions of the j-type individuals in the n-th generation form a point process. The asymptotic behavior of these point processes, when the generation size tends to infinity, is studied. The central limit theorem is proved.
متن کاملOptimal Online Selection of a Monotone Subsequence: A Central Limit Theorem
Consider a sequence of n independent random variables with a common continuous distribution F, and consider the task of choosing an increasing subsequence where the observations are revealed sequentially and where an observation must be accepted or rejected when it is first revealed. There is a unique selection policy πn* that is optimal in the sense that it maximizes the expected value of Ln(π...
متن کاملOn-Line Selection of c-Alternating Subsequences from a Random Sample
A sequence X 1 , X 2 , . . . , X n is a c-alternating sequence if any odd term is less than or equal to the next even term −c and the any even term is greater than or equal to the next odd term +c, where c is a nonnegative constant. In this paper, we present an optimal on-line procedure to select a c-alternating subsequence from a symmetric distributed random sample. We also give the optimal se...
متن کاملOnline Selection of Alternating Subsequences from a Random Sample
We consider sequential selection of an alternating subsequence from a sequence of independent, identically distributed, continuous random variables, and we determine the exact asymptotic behavior of an optimal sequentially selected subsequence. Moreover, we find (in a sense we make precise) that a person who is constrained to make sequential selections does only about 12 percent worse than a pe...
متن کاملA Prophet Inequality for On-line Selection of a Monotone Subsequence of a Random Sample
A brief proof is given for an upper bound on expected length of the optimal on-line selection of a monotone subsequence from a finite random sequence. The bound is valid for all sample sizes and it is sharp for large samples. We also provide a bound on the variance of the length of the optimal subsequence. Mathematics Subject Classification (2000): Primary 60C05, Secondary 60G42
متن کامل